Unconstrained handwriting recoganization basedon neural network using connectionist temporal classification token passing algorithm
نویسندگان
چکیده
منابع مشابه
Arabic Online Handwriting Recognition Using Neural Network
This article presents the development of an Arabic online handwriting recognition system. To develop our system, we have chosen the neural network approach. It offers solutions for most of the difficulties linked to Arabic script recognition. We test the approach with our collected databases. This system shows a good result and it has a high accuracy (98.50% for characters, 96.90% for words).
متن کاملStability of Token Passing
Suucient stability condition for the standard token passing ring is "known" since the seminal paper of Kuehn in 1979. However, this condition was derived without formal proof, and the proof seems to be of considerable interest to research community. In fact, Watson observed that in the performance evaluation of token passing rings "it is convenient to derive stability conditions ... (without pr...
متن کاملUnconstrained On-line Handwriting Recognition with Recurrent Neural Networks
In online handwriting recognition the trajectory of the pen is recorded during writing. Although the trajectory provides a compact and complete representation of the written output, it is hard to transcribe directly, because each letter is spread over many pen locations. Most recognition systems therefore employ sophisticated preprocessing techniques to put the inputs into a more localised form...
متن کاملNasal Speech Sounds Detection Using Connectionist Temporal Classification
Phone attributes, known also as distinctive or phonological features, belong to important classification of the speech sounds used in automatic speech processing. Training of conventional phone attribute detectors (classifiers), either based on acoustic measurements or deep learning approaches, requires decent phone boundary segmentation. This paper proposes a solution to train a phone attribut...
متن کاملA New Token Passing Distributed Mutual Exclusion Algorithm
Eliminating interference between concurrently executing activities through mutual exclusion is one of the most fundamental problems in computer systems. The problem of mutual exclusion in a distributed system is especially interesting owing to the lack of global knowledge in the presence of variable communication delays. In this paper, a new token-based distributed mutual exclusion algorithm is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering & Technology
سال: 2018
ISSN: 2227-524X
DOI: 10.14419/ijet.v7i1.9.9825